Characterizations of maximum matching graphs of certain types
نویسندگان
چکیده
منابع مشابه
CERTAIN TYPES OF EDGE m-POLAR FUZZY GRAPHS
In this research paper, we present a novel frame work for handling $m$-polar information by combining the theory of $m-$polar fuzzy sets with graphs. We introduce certain types of edge regular $m-$polar fuzzy graphs and edge irregular $m-$polar fuzzy graphs. We describe some useful properties of edge regular, strongly edge irregular and strongly edge totally irregular $m-$polar fuzzy graphs. W...
متن کاملCharacterizations of various matching extensions in graphs
Let n be a positive integer with n $; (V(O)-2)/2. A graph G is nextendable if it contains a set of n independent edges and every set of n independent edges can be extended to a perfect matching of G. In this paper, we give a characterization of n-extendable graphs. The characterizations of other matching extension are also discussed.
متن کاملCharacterizations of Certain Marshall-Olkin Generalized Distributions
Several characterizations of Marshall-Olkin generalized distributions, introduced by Gui (2013) and by Al-Saiari et al. (2014) are presented. These characterizations are based on: (i) a simple relationship between two truncated moments ; (ii) the hazard function.
متن کاملConditional Matching Preclusion Number of Certain Graphs
The matching preclusion number of a graph is the minimum number of neither edges whose deletion in a graph has a neither perfect matching nor an almost perfect matching. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. Recently the conditional matching preclusion number of a graph was introduced to look for sets beyond those induced by a single...
متن کاملMaximum matching on random graphs
– The maximum matching problem on random graphs is studied analytically by the cavity method of statistical physics. When the average vertex degree c is larger than 2.7183, groups of max-matching patterns which differ greatly from each other gradually emerge. An analytical expression for the max-matching size is also obtained, which agrees well with computer simulations. Discussion is made on t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2005
ISSN: 0012-365X
DOI: 10.1016/j.disc.2004.09.011